Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
111	Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218 Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:20 Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Set cover problem Approximation algorithm Facility location problem Dominating set Combinatorial optimization Reduction Algorithm
112	Petr Kolman Bernard Lidick´ y Jean-S´ebastien Sereni ON FAIR EDGE DELETION PROBLEMS ´ AND J.-S. SERENI P. KOLMAN, B. LIDICKY, Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2009-09-29 04:25:56 Graph theory Graph coloring NP-complete problems Combinatorial optimization Matching Treewidth Graph Bipartite graph Planar graph Ear decomposition Degree Line graph
113	Noname manuscript No. (will be inserted by the editor) Subjective interestingness of subgraph patterns Matthijs van Leeuwen · Tijl De Bie · Eirini Spyropoulou · C´ Add to Reading List Source URL: www.patternsthatmatter.org Language: English - Date: 2016-01-15 06:48:18 Graph theory Mathematics Dense graph Graph Clique NP-complete problems Spanning tree
114	Graph Editing to a Given Degree Sequence? Petr A. Golovach1,2 and George B. Mertzios3 1 Department of Informatics, University of Bergen, Norway, . 2 Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2016-03-02 03:52:29 Graph theory Mathematics Graph coloring Degree Graph Eulerian path Ear decomposition NP-complete problems Graph operations Dominating set Incidence coloring
115	CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-05 12:59:35 Graph theory Computational complexity theory Mathematics NP-complete problems Clique problem Planted clique Graph partition Graph coloring Clique Time complexity Maximal independent set Pathwidth
116	Microsoft Wordtext.nativedoc Add to Reading List Source URL: web.uvic.ca Language: English - Date: 2012-11-03 03:43:42 Graph theory Computational complexity theory Mathematics NP-complete problems Vertex cover Clique Degree Connectivity Independent set Graph coloring
117	CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-10 00:55:12 Graph theory Mathematics Spanning tree Steiner tree problem Minimum spanning tree Shortest path problem Eulerian path Line graph Expected linear time MST algorithm Minimum bottleneck spanning tree
118	Finding vertex-surjective graph homomorphisms? Petr A. Golovach1 , Bernard Lidick´ y2 , 1 Barnaby Martin , and Dani¨el Paulusma1 Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2012-06-12 14:31:34 Graph theory Morphisms Graph operations NP-complete problems Graph coloring Graph homomorphism Graph isomorphism Pathwidth Hypergraph Treewidth Cograph Graph
119	CS261: Exercise Set #8 For the week of February 22–26, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza. Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-26 12:53:21 Mathematics Computational complexity theory Graph theory NP-complete problems Operations research Travelling salesman problem Theoretical computer science Approximation algorithm Steiner tree problem Greedy algorithm Optimization problem Set cover problem
120	Service Retrieval Based on Behavioral Specification and Quality Requirements Daniela Grigori, Veronika Peralta, Mokrane Bouzeghoub PRISM, University of Versailles, France Add to Reading List Source URL: bpm2005.loria.fr Language: English - Date: 2005-09-12 10:45:10 Mathematics Graph theory Computational complexity theory NP-complete problems Subgraph isomorphism problem Graph isomorphism Matching Graph Vertex Induced subgraph isomorphism problem Graph coloring

UPDATE